Algorithms to Approximate Column-Sparse Packing Problems
نویسندگان
چکیده
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation algorithms for some well-known families of such problems. As three main examples, we attain the integrality gap, up to lower-order terms, for known LP relaxations for k-column sparse packing integer programs (Bansal et al., Theory of Computing, 2012) and stochastic k-set packing (Bansal et al., Algorithmica, 2012), and go “half the remaining distance” to optimal for a major integrality-gap conjecture of Füredi, Kahn and Seymour on hypergraph matching (Combinatorica, 1993).
منابع مشابه
On k-Column Sparse Packing Programs
We consider the class of packing integer programs (PIPs) that are column sparse, where there is a specified upper bound k on the number of constraints that each variable appears in. We give an improved (ek + o(k))-approximation algorithm for k-column sparse PIPs. Our algorithm is based on a linear programming relaxation, and involves randomized rounding combined with alteration. We also show th...
متن کاملIterative Packing for Demand and Hypergraph Matching
Iterative rounding has enjoyed tremendous success in elegantly resolving open questions regarding the approximability of problems dominated by covering constraints. Although iterative rounding methods have been applied to packing problems, no single method has emerged that matches the effectiveness and simplicity afforded by the covering case. We offer a simple iterative packing technique that ...
متن کاملApproximate Inverse Preconditioners via Sparse-Sparse Iterations
The standard incomplete LU (ILU) preconditioners often fail for general sparse in-deenite matrices because they give rise tòunstable' factors L and U. In such cases, it may be attractive to approximate the inverse of the matrix directly. This paper focuses on approximate inverse preconditioners based on minimizing kI ? AMk F , where AM is the preconditioned matrix. An iterative descent-type met...
متن کاملApproximate Inverse Preconditioners for General Sparse Matrices
The standard Incomplete LU (ILU) preconditioners often fail for general sparse indeenite matrices because they give rise tòunstable' factors L and U. In such cases, it may be attractive to approximate the inverse of the matrix directly. This paper focuses on approximate inverse preconditioners based on minimizing kI?AMk F , where AM is the preconditioned matrix. An iterative descent-type method...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کامل